Convergence acceleration of alternating series
نویسنده
چکیده
A new simple convergence acceleration method is proposed for a certain wide range class of convergent alternating series. The method has some common features with Smith’s and Ford’s modification of Levin’s and Weniger’s sequence transformations, but it leads to less computational and memory cost. The similarities and differences between all three methods are analyzed and some common theoretical results are given. Numerical examples confirm a similar performance of all three methods.
منابع مشابه
On condition numbers of some quasi-linear transformations
Convergence acceleration processes are known to be well conditioned for alternating sequences and ill conditioned for monotonic ones. The aim of this paper is to adapt the de nition of conditioning and to give a link between this notion and the property of convergence acceleration. The cases of the linear and logarithmic convergence are studied in details. c © 1999 Elsevier Science B.V. All rig...
متن کاملFixed-point Fast Sweeping Weno Methods for Steady State Solution of Scalar Hyperbolic Conservation Laws
Fast sweeping methods were developed in the literature to efficiently solve static Hamilton-Jacobi equations. This class of methods utilize the Gauss-Seidel iterations and alternating sweeping strategy to achieve fast convergence rate. They take advantage of the properties of hyperbolic partial differential equations (PDEs) and try to cover a family of characteristics of the corresponding Hamil...
متن کاملAcceleration of Slowly Convergent Se- Ries via the Generalized Weighted-averages Method
A generalized version of the weighted-averages method is presented for the acceleration of convergence of sequences and series over a wide range of test problems, including linearly and logarithmically convergent series as well as monotone and alternating series. This method was originally developed in a partitionextrapolation procedure for accelerating the convergence of semiinfinite range int...
متن کاملAcceleration of Convergence of the Alternating Least Squares Algorithm for Nonlinear Principal Components Analysis
Principal components analysis (PCA) is a popular descriptive multivariate method for handling quantitative data. In PCA of a mixture of quantitative and qualitative data, it requires quantification of qualitative data to obtain optimal scaling data and use ordinary PCA. The extended PCA including such quantification is called nonlinear PCA, see Gifi [Gifi, 1990]. The existing algorithms for non...
متن کاملConvergence Acceleration of Alternating Series
We discuss some linear acceleration methods for alternating series which are in theory and in practice much better than that of Euler-Van Wijngaarden. One of the algorithms, for instance, permits one to calculate P (?1) k a k with an error of about 17:93 ?n from the rst n terms for a wide class of sequences fa k g. Such methods are useful for high precision calculations frequently appearing in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1702.07199 شماره
صفحات -
تاریخ انتشار 2017